________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:16:14
Input Data from:  dataset109.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,074
Average f[i]   :3800
Average g[i,j] :1880,95238095238
Total demand   :5650
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	830	1	-1	5	6500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0    >new incumb.: 830


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 27
> Selected Move:	1160	1	-1	6	13000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0    >new incumb.: 1160


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 36
> Selected Move:	1380	1	-1	7	17500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0    >new incumb.: 1380


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 34
> Selected Move:	1380	3	2	8	19400


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 15
> Selected Move:	1380	4	8	5	18000


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 22
> Selected Move:	1380	4	5	6	18000


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 27
> Selected Move:	1300	3	7	4	18000


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 23
> Selected Move:	1300	4	6	5	18000


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 22
> Selected Move:	1300	4	5	8	19400


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 19
> Selected Move:	1300	3	8	2	17500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 32
> Selected Move:	1330	3	4	9	18500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 33
> Selected Move:	1290	3	9	3	18000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 33
> Selected Move:	1320	3	2	9	19800


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 19
> Selected Move:	1320	4	9	5	18500


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 23
> Selected Move:	1320	4	5	6	18500


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 24
> Selected Move:	1280	3	3	8	19000


> New Y[]: 
	
	 2  3  0  0  0  1  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 23
> Selected Move:	1280	4	6	5	19000


> New Y[]: 
	
	 2  3  0  0  0  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 23
> Selected Move:	1260	3	6	7	17000


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 26
> Selected Move:	1260	4	5	7	19400


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 20
> Selected Move:	1260	4	7	8	18400


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 24
> Selected Move:	1260	4	8	9	18300


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 23
> Selected Move:	1260	3	8	3	17800


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  4 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 24
> Selected Move:	1260	4	9	3	18900


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 21
> Selected Move:	1260	4	3	5	16500


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 22
> Selected Move:	1260	4	5	7	18900


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 22
> Selected Move:	1260	3	5	6	18900


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 19
> Selected Move:	1260	4	7	3	18900


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 18
> Selected Move:	1260	4	3	6	16500


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 22
> Selected Move:	1260	4	6	9	17800


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 21
> Selected Move:	1260	3	3	5	19300


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 19
> Selected Move:	1260	4	9	5	18000


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 22
> Selected Move:	1260	4	5	6	18000


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 21
> Selected Move:	1260	3	6	2	16500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 33
> Selected Move:	1270	3	0	6	18300


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 30
> Selected Move:	1270	4	6	5	18900


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 27
> Selected Move:	1270	4	5	9	19100


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 25
> Selected Move:	1200	4	9	7	20200


> New Y[]: 
	
	 0  3  4  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 22
> Selected Move:	1130	3	9	3	19700


> New Y[]: 
	
	 0  3  4  1  0  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 26
> Selected Move:	1130	4	7	3	19100


> New Y[]: 
	
	 0  3  4  2  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 26
> Selected Move:	1130	4	3	5	18400


> New Y[]: 
	
	 0  3  4  1  0  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 28
> Selected Move:	1144	3	2	9	20200


> New Y[]: 
	
	 0  3  0  1  0  2  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 25
> Selected Move:	1210	4	5	6	19600


> New Y[]: 
	
	 0  3  0  1  0  1  2  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 25
> Selected Move:	1210	4	6	9	19100


> New Y[]: 
	
	 0  3  0  1  0  1  4  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 25
> Selected Move:	1220	3	3	8	19600


> New Y[]: 
	
	 0  3  0  0  0  1  4  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 24
> Selected Move:	1220	4	6	5	19600


> New Y[]: 
	
	 0  3  0  0  0  4  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 25
> Selected Move:	1220	4	9	6	18800


> New Y[]: 
	
	 0  3  0  0  0  4  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 25
> Selected Move:	1220	4	5	6	19400


> New Y[]: 
	
	 0  3  0  0  0  2  4  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 23
> Selected Move:	1220	4	5	8	19900


> New Y[]: 
	
	 0  3  0  0  0  1  4  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 23
> Selected Move:	1220	4	6	5	19900


> New Y[]: 
	
	 0  3  0  0  0  4  1  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 23
> Selected Move:	1210	3	8	3	19600


> New Y[]: 
	
	 0  3  0  2  0  4  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 24
> Selected Move:	1210	4	3	6	18300


> New Y[]: 
	
	 0  3  0  1  0  4  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 23
> Selected Move:	1210	4	5	6	18900


> New Y[]: 
	
	 0  3  0  1  0  2  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 21
> Selected Move:	1210	4	5	3	19600


> New Y[]: 
	
	 0  3  0  2  0  1  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 22
> Selected Move:	1157	4	3	7	20200


> New Y[]: 
	
	 0  3  0  1  0  1  4  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 23
> Selected Move:	1158	4	6	5	20200


> New Y[]: 
	
	 0  3  0  1  0  4  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 23
> Selected Move:	1210	4	7	9	19100


> New Y[]: 
	
	 0  3  0  1  0  4  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 21
> Selected Move:	1210	3	9	0	17500


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 23
> Selected Move:	1240	3	7	8	18500


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 24
> Selected Move:	1240	4	5	6	18500


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 24
> Selected Move:	1240	4	6	8	19900


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 23
> Selected Move:	1210	3	8	7	19900


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 18
> Selected Move:	1290	3	3	8	20400


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 24
> Selected Move:	1250	3	7	2	18500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 32
> Selected Move:	1236	3	2	4	20300


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 24
> Selected Move:	1217	3	4	9	20300


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 18
> Selected Move:	1220	3	5	7	18300


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 23
> Selected Move:	1220	4	9	6	17000


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 22
> Selected Move:	1220	4	6	7	19400


> New Y[]: 
	
	 2  3  0  0  0  0  1  4  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 20
> Selected Move:	1220	4	7	8	18400


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 21
> Selected Move:	1260	3	8	2	16500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 70 #######################


> Neighbours evaluated; 34
> Selected Move:	1270	3	1	5	18600


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 71 #######################


> Neighbours evaluated; 33
> Selected Move:	1270	4	5	6	18300


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 72 #######################


> Neighbours evaluated; 33
> Selected Move:	1270	4	6	9	19400


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 73 #######################


> Neighbours evaluated; 32
> Selected Move:	1190	3	7	4	19400


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 74 #######################


> Neighbours evaluated; 29
> Selected Move:	1190	4	9	5	18600


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 75 #######################


> Neighbours evaluated; 32
> Selected Move:	1190	4	5	6	18300


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,15

## ITERATION 76 #######################


> Neighbours evaluated; 32
> Selected Move:	1180	3	6	1	16500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,145

## ITERATION 77 #######################


> Neighbours evaluated; 37
> Selected Move:	1190	3	0	6	18300


> New Y[]: 
	
	 0  3  4  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,14

## ITERATION 78 #######################


> Neighbours evaluated; 32
> Selected Move:	1190	4	6	5	18900


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 79 #######################


> Neighbours evaluated; 31
> Selected Move:	1190	4	5	9	19100


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 80 #######################


> Neighbours evaluated; 29
> Selected Move:	1164	4	9	4	20200


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 81 #######################


> Neighbours evaluated; 30
> Selected Move:	1118	3	4	3	20100


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 82 #######################


> Neighbours evaluated; 28
> Selected Move:	1130	4	3	5	19400


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 83 #######################


> Neighbours evaluated; 28
> Selected Move:	1130	4	5	6	18800


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,11

## ITERATION 84 #######################


> Neighbours evaluated; 30
> Selected Move:	1180	3	6	0	17000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 85 #######################


> Neighbours evaluated; 34
> Selected Move:	1243	1	-1	7	21500


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 86 #######################


> Neighbours evaluated; 35
> Selected Move:	1260	3	9	6	22500


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 87 #######################


> Neighbours evaluated; 33
> Selected Move:	1265	3	3	9	23000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0999999999999996

## ITERATION 88 #######################


> Neighbours evaluated; 24
> Selected Move:	1250	3	9	4	22000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,105

## ITERATION 89 #######################


> Neighbours evaluated; 36
> Selected Move:	1225	3	5	9	21000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0 
 > pw :0,11

## ITERATION 90 #######################


> Neighbours evaluated; 38
> Selected Move:	1220	3	6	5	21000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 91 #######################


> Neighbours evaluated; 35
> Selected Move:	1193	3	9	3	20500


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 92 #######################


> Neighbours evaluated; 36
> Selected Move:	1180	2	4	-1	16000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 93 #######################


> Neighbours evaluated; 33
> Selected Move:	1210	3	2	6	17500


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 94 #######################


> Neighbours evaluated; 22
> Selected Move:	1210	4	6	3	19900


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 95 #######################


> Neighbours evaluated; 21
> Selected Move:	1199	3	7	9	20900


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,14

## ITERATION 96 #######################


> Neighbours evaluated; 22
> Selected Move:	1224	3	3	8	20400


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,145

## ITERATION 97 #######################


> Neighbours evaluated; 21
> Selected Move:	1202	3	8	7	20400


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,15

## ITERATION 98 #######################


> Neighbours evaluated; 20
> Selected Move:	1135	3	7	4	20300


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,155

## ITERATION 99 #######################


> Neighbours evaluated; 23
> Selected Move:	1180	4	4	5	18000


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,16

## ITERATION 100 #######################


> Neighbours evaluated; 26
> Selected Move:	1180	4	5	6	18000


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,165

## ITERATION 101 #######################


> Neighbours evaluated; 24
> Selected Move:	1180	4	6	9	19300


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,16

## ITERATION 102 #######################


> Neighbours evaluated; 22
> Selected Move:	1180	3	5	3	17800


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 103 #######################


> Neighbours evaluated; 27
> Selected Move:	1180	4	9	3	18900


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 104 #######################


> Neighbours evaluated; 25
> Selected Move:	1180	4	3	4	18800


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 105 #######################


> Neighbours evaluated; 24
> Selected Move:	1180	4	4	6	16500


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 106 #######################


> Neighbours evaluated; 26
> Selected Move:	1190	1	-1	7	21000


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 107 #######################


> Neighbours evaluated; 30
> Selected Move:	1195	3	6	5	21000


> New Y[]: 
	
	 2  3  0  1  1  4  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 108 #######################


> Neighbours evaluated; 30
> Selected Move:	1180	2	7	-1	16500


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 109 #######################


> Neighbours evaluated; 27
> Selected Move:	1180	4	5	3	18900


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 110 #######################


> Neighbours evaluated; 24
> Selected Move:	1180	4	3	4	18800


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 111 #######################


> Neighbours evaluated; 23
> Selected Move:	1180	4	4	9	17800


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  4 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,11

## ITERATION 112 #######################


> Neighbours evaluated; 24
> Selected Move:	1180	3	3	8	18300


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,105

## ITERATION 113 #######################


> Neighbours evaluated; 26
> Selected Move:	1180	4	9	4	19300


> New Y[]: 
	
	 2  3  0  0  4  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,0999999999999996

## ITERATION 114 #######################


> Neighbours evaluated; 23
> Selected Move:	1180	4	4	5	17000


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,0949999999999996

## ITERATION 115 #######################


> Neighbours evaluated; 25
> Selected Move:	1188	1	-1	7	21500


> New Y[]: 
	
	 2  3  0  0  1  4  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,0899999999999996

## ITERATION 116 #######################


> Neighbours evaluated; 28
> Selected Move:	1225	3	9	6	22500


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,0849999999999996

## ITERATION 117 #######################


> Neighbours evaluated; 29
> Selected Move:	1238	4	5	6	22500


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,0799999999999996

## ITERATION 118 #######################


> Neighbours evaluated; 30
> Selected Move:	1220	3	4	3	23000


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 119 #######################


> Neighbours evaluated; 30
> Selected Move:	1315	3	8	9	23000


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0799999999999996

## ITERATION 120 #######################


> Neighbours evaluated; 23
> Selected Move:	1300	4	6	5	23000


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0849999999999996

## ITERATION 121 #######################


> Neighbours evaluated; 24
> Selected Move:	1223	3	5	2	21500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 122 #######################


> Neighbours evaluated; 31
> Selected Move:	1155	3	9	4	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 123 #######################


> Neighbours evaluated; 36
> Selected Move:	1193	3	7	5	22500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 124 #######################


> Neighbours evaluated; 33
> Selected Move:	1170	3	3	9	23000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,105

## ITERATION 125 #######################


> Neighbours evaluated; 20
> Selected Move:	1180	2	5	-1	16500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0 
 > pw :0,11

## ITERATION 126 #######################


> Neighbours evaluated; 31
> Selected Move:	1140	3	2	8	18400


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 127 #######################


> Neighbours evaluated; 23
> Selected Move:	1180	3	6	5	18400


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0 
 > pw :0,12

## ITERATION 128 #######################


> Neighbours evaluated; 21
> Selected Move:	1130	3	4	3	18900


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 129 #######################


> Neighbours evaluated; 25
> Selected Move:	1130	4	8	3	19900


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 130 #######################


> Neighbours evaluated; 22
> Selected Move:	1140	3	3	2	17500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 131 #######################


> Neighbours evaluated; 32
> Selected Move:	1140	3	9	7	16500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 132 #######################


> Neighbours evaluated; 34
> Selected Move:	1130	3	2	3	18900


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 133 #######################


> Neighbours evaluated; 26
> Selected Move:	1137	3	7	6	20900


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 134 #######################


> Neighbours evaluated; 19
> Selected Move:	1130	3	8	4	19900


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 135 #######################


> Neighbours evaluated; 22
> Selected Move:	1130	4	3	4	19800


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 136 #######################


> Neighbours evaluated; 21
> Selected Move:	1130	4	4	5	17500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 137 #######################


> Neighbours evaluated; 23
> Selected Move:	1175	1	-1	9	23000


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0899999999999996

## ITERATION 138 #######################


> Neighbours evaluated; 28
> Selected Move:	1190	4	5	6	23000


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0849999999999996

## ITERATION 139 #######################


> Neighbours evaluated; 28
> Selected Move:	1193	3	6	2	21500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 140 #######################


> Neighbours evaluated; 29
> Selected Move:	1150	3	5	6	21500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 141 #######################


> Neighbours evaluated; 29
> Selected Move:	1130	2	4	-1	17000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 142 #######################


> Neighbours evaluated; 30
> Selected Move:	1130	3	1	5	19100


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 143 #######################


> Neighbours evaluated; 31
> Selected Move:	1130	4	5	3	20000


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 144 #######################


> Neighbours evaluated; 31
> Selected Move:	1180	3	3	7	21000


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 145 #######################


> Neighbours evaluated; 30
> Selected Move:	1124	3	7	4	20700


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 146 #######################


> Neighbours evaluated; 29
> Selected Move:	1040	3	4	8	20500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,105

## ITERATION 147 #######################


> Neighbours evaluated; 30
> Selected Move:	1090	4	8	5	19600


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,11

## ITERATION 148 #######################


> Neighbours evaluated; 31
> Selected Move:	1090	4	5	6	19300


> New Y[]: 
	
	 2  0  4  0  0  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 149 #######################


> Neighbours evaluated; 30
> Selected Move:	1130	3	8	3	18800


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,11

## ITERATION 150 #######################


> Neighbours evaluated; 28
> Selected Move:	1133	3	2	7	20700


> New Y[]: 
	
	 2  0  0  1  0  1  3  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,105

## ITERATION 151 #######################


> Neighbours evaluated; 27
> Selected Move:	1210	4	7	5	18300


> New Y[]: 
	
	 2  0  0  1  0  4  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0999999999999996

## ITERATION 152 #######################


> Neighbours evaluated; 27
> Selected Move:	1220	3	3	8	18800


> New Y[]: 
	
	 2  0  0  0  0  4  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 153 #######################


> Neighbours evaluated; 27
> Selected Move:	1220	4	5	6	19100


> New Y[]: 
	
	 2  0  0  0  0  3  4  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 154 #######################


> Neighbours evaluated; 26
> Selected Move:	1220	4	5	8	20000


> New Y[]: 
	
	 2  0  0  0  0  1  4  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 155 #######################


> Neighbours evaluated; 27
> Selected Move:	1220	4	6	5	20000


> New Y[]: 
	
	 2  0  0  0  0  4  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 26
> Selected Move:	1220	4	8	9	19900


> New Y[]: 
	
	 2  0  0  0  0  4  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 157 #######################


> Neighbours evaluated; 26
> Selected Move:	1220	4	5	6	19900


> New Y[]: 
	
	 2  0  0  0  0  1  4  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 25
> Selected Move:	1213	4	6	9	20100


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 159 #######################


> Neighbours evaluated; 25
> Selected Move:	1210	3	8	3	19600


> New Y[]: 
	
	 2  0  0  1  0  1  3  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0599999999999996

## ITERATION 160 #######################


> Neighbours evaluated; 25
> Selected Move:	1210	4	6	5	19900


> New Y[]: 
	
	 2  0  0  1  0  3  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0549999999999996

## ITERATION 161 #######################


> Neighbours evaluated; 27
> Selected Move:	1210	4	5	9	19400


> New Y[]: 
	
	 2  0  0  1  0  4  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0499999999999996

## ITERATION 162 #######################


> Neighbours evaluated; 24
> Selected Move:	1210	4	5	6	19400


> New Y[]: 
	
	 2  0  0  1  0  1  4  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0449999999999996

## ITERATION 163 #######################


> Neighbours evaluated; 24
> Selected Move:	1210	4	9	3	19500


> New Y[]: 
	
	 2  0  0  3  0  1  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0399999999999996

## ITERATION 164 #######################


> Neighbours evaluated; 26
> Selected Move:	1210	4	3	5	18600


> New Y[]: 
	
	 2  0  0  1  0  3  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0349999999999996

## ITERATION 165 #######################


> Neighbours evaluated; 23
> Selected Move:	1175	4	5	7	21000


> New Y[]: 
	
	 2  0  0  1  0  1  4  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0299999999999996

## ITERATION 166 #######################


> Neighbours evaluated; 23
> Selected Move:	1180	4	6	5	21000


> New Y[]: 
	
	 2  0  0  1  0  4  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0249999999999996

## ITERATION 167 #######################


> Neighbours evaluated; 25
> Selected Move:	1210	4	7	3	19500


> New Y[]: 
	
	 2  0  0  3  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0199999999999996

## ITERATION 168 #######################


> Neighbours evaluated; 23
> Selected Move:	1200	1	-1	4	24000


> New Y[]: 
	
	 2  0  0  3  1  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,0149999999999996

## ITERATION 169 #######################


> Neighbours evaluated; 27
> Selected Move:	1293	3	3	1	22500


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,00999999999999962

## ITERATION 170 #######################


> Neighbours evaluated; 22
> Selected Move:	1535	1	-1	3	27500


> New Y[]: 
	
	 2  3  0  1  1  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0149999999999996

## ITERATION 171 #######################


> Neighbours evaluated; 26
> Selected Move:	1498	4	5	6	27500


> New Y[]: 
	
	 2  3  0  1  1  1  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0199999999999996

## ITERATION 172 #######################


> Neighbours evaluated; 27
> Selected Move:	1434	4	6	9	28800


> New Y[]: 
	
	 2  3  0  1  1  1  1  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0249999999999996

## ITERATION 173 #######################


> Neighbours evaluated; 29
> Selected Move:	1433	2	4	-1	24300


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0299999999999996

## ITERATION 174 #######################


> Neighbours evaluated; 22
> Selected Move:	1378	4	9	3	25400


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0349999999999996

## ITERATION 175 #######################


> Neighbours evaluated; 26
> Selected Move:	1351	4	3	7	25400


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0399999999999996

## ITERATION 176 #######################


> Neighbours evaluated; 25
> Selected Move:	1270	3	7	2	23500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0449999999999996

## ITERATION 177 #######################


> Neighbours evaluated; 18
> Selected Move:	1270	1	-1	7	28000


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0499999999999996

## ITERATION 178 #######################


> Neighbours evaluated; 29
> Selected Move:	1245	3	3	4	27500


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0549999999999996

## ITERATION 179 #######################


> Neighbours evaluated; 32
> Selected Move:	1195	3	9	3	27000


> New Y[]: 
	
	 2  3  4  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 180 #######################


> Neighbours evaluated; 31
> Selected Move:	1160	4	2	5	22000


> New Y[]: 
	
	 2  3  0  1  1  4  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 181 #######################


> Neighbours evaluated; 24
> Selected Move:	1265	3	4	8	23000


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 182 #######################


> Neighbours evaluated; 27
> Selected Move:	1255	3	3	9	23500


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0749999999999996

## ITERATION 183 #######################


> Neighbours evaluated; 17
> Selected Move:	1238	4	5	6	23500


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,0799999999999996

## ITERATION 184 #######################


> Neighbours evaluated; 18
> Selected Move:	1200	3	6	2	22000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 185 #######################


> Neighbours evaluated; 30
> Selected Move:	1215	3	9	6	23000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 186 #######################


> Neighbours evaluated; 30
> Selected Move:	1130	3	5	9	22000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 187 #######################


> Neighbours evaluated; 30
> Selected Move:	1090	2	7	-1	17500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 188 #######################


> Neighbours evaluated; 31
> Selected Move:	1140	3	2	4	19300


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 189 #######################


> Neighbours evaluated; 20
> Selected Move:	1140	4	4	6	17000


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 190 #######################


> Neighbours evaluated; 24
> Selected Move:	1140	4	6	9	18300


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 191 #######################


> Neighbours evaluated; 24
> Selected Move:	1094	3	1	5	20400


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 192 #######################


> Neighbours evaluated; 27
> Selected Move:	1172	3	4	7	20400


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 193 #######################


> Neighbours evaluated; 21
> Selected Move:	1158	4	9	8	20500


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  4  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 194 #######################


> Neighbours evaluated; 22
> Selected Move:	1194	4	5	6	20200


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  4  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 195 #######################


> Neighbours evaluated; 21
> Selected Move:	1116	3	8	3	20700


> New Y[]: 
	
	 2  0  0  4  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,14

## ITERATION 196 #######################


> Neighbours evaluated; 20
> Selected Move:	1070	4	6	5	21000


> New Y[]: 
	
	 2  0  0  4  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,145

## ITERATION 197 #######################


> Neighbours evaluated; 19
> Selected Move:	1065	4	3	7	21000


> New Y[]: 
	
	 2  0  0  1  0  3  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,15

## ITERATION 198 #######################


> Neighbours evaluated; 20
> Selected Move:	995	3	3	8	21500


> New Y[]: 
	
	 2  0  0  0  0  3  1  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 199 #######################


> Neighbours evaluated; 21
> Selected Move:	1034	4	5	6	21200


> New Y[]: 
	
	 2  0  0  0  0  1  3  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 200 #######################


> Neighbours evaluated; 20
> Selected Move:	980	4	6	7	21500


> New Y[]: 
	
	 2  0  0  0  0  1  4  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 201 #######################


> Neighbours evaluated; 20
> Selected Move:	998	3	7	3	20500


> New Y[]: 
	
	 2  0  0  3  0  1  4  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 202 #######################


> Neighbours evaluated; 24
> Selected Move:	1130	3	8	4	19500


> New Y[]: 
	
	 2  0  0  3  1  1  4  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,175
________________________________________________________________

Best solution found: 1380
Run Termination time: 31.01.2010 10:16:52
Run duration: 00:00:37.6250000
________________________________________________________________
